Multiple Shape Correspondence by Dynamic Programming
نویسندگان
چکیده
منابع مشابه
Multiple Shape Correspondence by Dynamic Programming
We present a multiple shape correspondence method based on dynamic programming, that computes consistent bijective maps between all shape pairs in a given collection of initially unmatched shapes. As a fundamental distinction from previous work, our method aims to explicitly minimize the overall distortion, i.e., the average isometric distortion of the resulting maps over all shape pairs. We ca...
متن کاملShape Indexing by Dynamic Programming
With the vast amount of publicly available high-quality images, image databases start to emerge, and image database management methods are becoming essential. An important manner of finding your way around an image database is to look for images similar to a desired reference image. There are many indicators for content similarity of images: color, texture, composition etc. In this paper we foc...
متن کاملShape-preserving dynamic programming
The multi-stage decision-making problems are numerically challenging. When the problems are time-separable, dynamic programming (DP) is a popular method to solve them. In DP problems, if state variables and control variables are continuous such that value functions are also continuous, then we have to use some approximation for the value functions, since computers cannot model the entire space ...
متن کاملA Multifeature Correspondence Algorithm Using Dynamic Programming
Abstract Correspondence between pixels is an important problem in stereo vision. Several algorithms have been proposed to carry out this task in literature. Almost all of them employ only gray-values. We show here that addition of primary or secondary evidence maps can improve the correspondence computation. However any particular combination is not guaranteed to provide proper results in a gen...
متن کاملShape Retrieval Using ECPDH with Dynamic Programming
The matching and retrieval of the 2D shapes are challenging issues in object recognition and computer vision. In this paper, we propose a new object contour descriptor termed ECPDH (Elliptic Contour Points Distribution Histogram), which is based on the distribution of the points on an object contour under the polar coordinates. ECPDH has the essential merits of invariance to scale and translati...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computer Graphics Forum
سال: 2014
ISSN: 0167-7055
DOI: 10.1111/cgf.12480